A universal algorithm for Krull's theorem

Mani and shapur a universal faith for e universal kingdom

A Universal Coefficient Theorem for Gauss’s Lemma

We shall prove a version of Gauß’s Lemma that recursively constructs polynomials {ck}k=0,...,m+n in Z[ai, Ai, bj , Bj ]i=0,...,m, j=0,...,n, of degree at most ( m+n n ) , such that whenever ∑ k CkX k = ∑ i AiX i · ∑ j BjX j and 1 = ∑

A universal tree balancing theorem

We present a general framework for balancing expressions (terms) in form of so called tree straight-line programs. The latter can be seen as circuits over the free term algebra extended by contexts (terms with a hole) and the operations which insert terms/contexts into contexts. It is shown that for every term one can compute in DLOGTIME-uniform TC$^0$ a tree straight-line program of logarithmi...

Universal approximation theorem for Dirichlet series

The paper deals with an extension theorem by Costakis and Vlachou on simultaneous approximation for holomorphic function to the setting of Dirichlet series, which are absolutely convergent in the right half of the complex plane. The derivation operator used in the analytic case is substituted by a weighted backward shift operator in the Dirichlet case. We show the similarities and extensions in...

Algorithm for Lang’s Theorem

We give an efficient algorithm for Lang’s Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie type. We use an algorithm for computing a Chevalley basis for a split reductive Lie algebra, which is of independent interest.